#include"BTree.h"
int main()
{
	BTNode* n1 = BuyNode(1);
	BTNode* n2 = BuyNode(2);
	BTNode* n3 = BuyNode(3);
	BTNode* n4 = BuyNode(4);
	BTNode* n5 = BuyNode(5);
	BTNode* n6 = BuyNode(6);
	BTNode* n7 = BuyNode(7);
	n1->left = n2;
	n2->left = n3;
	n2->right = n7;
	n1->right = n4;
	n4->left = n5;
	n4->right = n6;
	int size=TreeSize(n1);
	printf("%d ", size);
	size = TreeLeafSize(n1);
	printf("%d ", size);
	size = TreeHeight(n1);
	printf("%d ", size);
	LevelOrder(n1);
	size = BinaryTreeComplete(n1);
	printf("%d ", size);
	BinaryTreeDestory(n1);
	n1 = NULL;
	/*PreOrder(n1);
	printf("\n");
	InOrder(n1);
	printf("\n");
	PostOrder(n1);
	printf("\n");*/
	return 0;
}
;